Quantum Fourier transform of the Prime state
نویسندگان
چکیده
Quantum Computation is a growing and important field in applied physics research, so further theoretical foundations are continuously requested. In this regard, some mathematical algorithms have already been proposed. For instance, creating a quantum state representing the superposition of all prime number less than a value N has been shown to be efficient, and also applying the Quantum Fourier transform to it. This paper discusses the result of doing this operation and shows that some deep mathematical properties of prime numbers, such the Prime Counting function or biases in primes distribution, like the Chebyshev bias, are easily accessible via a systematic statistical approach.
منابع مشابه
Quantum computation of prime number functions
We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than 2, where n is the number of qubits of the register. This Prime state can be built using Grover’s algorithm, whose oracle is a quantum implementation of the classical Miller-Rabin primality test. The Prime state is highly entangled, and its entanglement measures encode...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملThe Hidden Subgroup Problem in Affine Groups: Basis Selection in Fourier Sampling
Abstract Some quantum algorithms, including Shor’s celebrated factoring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which a subgroup H of a group G must be determined from a quantum state ψ uniformly supported on a left coset of H . These hidden subgroup problems are then solved by Fourier sampling: the quantum Fourier transform of ψ is computed and measur...
متن کاملQuantum fast Fourier transform using multilevel atoms
We propose an implementation of the quantum fast Fourier transform algorithm in an entangled system of multilevel atoms. The Fourier transform occurs naturally in the unitary time evolution of energy eigenstates and is used to de®ne an alternative wave-packet basis for quantum information in the atom. A change of basis from energy levels to wave packets amounts to a discrete quantum Fourier tra...
متن کاملQuantum computing and a unified approach to fast unitary transforms
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-k...
متن کامل